Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking

Model checking techniques suffer from the state space explosion problem: as the size of the system being verified increases, the total state space of the system increases exponentially. Some of the methods that have been devised to tackle this problem are partial order reduction, symmetry reduction, hash compaction, selective state caching, etc. One approach to the problem that has gained inter...

متن کامل

Random walk with memory

There are a large number of different modifications and variants of the usual symmetrical random walk ~RW!. Let us mention only Levy flights, biased diffusions, self-avoiding walk ~SAW for short!, etc. Let us confine ourselves to the random walks on the discrete lattices. In SAW a walking particle is choosing its trajectory in such a way that it does not step down onto the already visited site....

متن کامل

Detection of network communities with memory-biased random walk algorithms

Community structure and its detection in complex networks has been the subject of many studies in the recent years. Towards this goal, we have created a novel approach based on the analysis of the motion of a memory-biased random walker, i.e. an entity that traverses the network with some tendency to follow or avoid pathways it has previously traversed. We found that the walker tends to remain ...

متن کامل

Distributed-Memory Model Checking with SPIN

The main limiting factor of the model checker SPIN is currently the amount of available physical memory. This paper explores the possibility of exploiting a distributed-memory execution environment, such as a network of workstations interconnected by a standard LAN, to extend the size of the veri cation problems that can be successfully handled by SPIN. A distributed version of the algorithm us...

متن کامل

Exemplar-Based Random-Walk Model 1 An Exemplar-Based Random-Walk Model of Categorization and Recognition

Exemplar-Based Random-Walk Model 2 Abstract A fundamental issue in cognitive psychology and cognitive science concerns the manner in which people represent categories in memory and make decisions about category membership. In this chapter we provide a review of a process-oriented mathematical model of categorization known as the exemplar-based random-walk (EBRW) model (Nosofsky & Palmeri, 1997a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2003

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)80096-9